Concurrent Programming Made Easy

نویسندگان

  • Rafael Ramirez
  • Andrew E. Santosa
  • Roland H. C. Yap
چکیده

The task of programming concurrent systems is substantially more difficult than the task of programming sequential systems with respect to both correctness and efficiency. In this paper we describe a constraint-based methodology for writing concurrent applications. A system is modeled as: (a) a set of processes containing a sequence of “markers” denoting the processes points of interest; and (b) a constraint store. Process synchronization is specified by incrementally adding constraints on the markers’ execution order into the constraint store. The constraint store contains a declarative specification based on a temporal constraint logic program. The store, thus, acts as a coordination entity which on the one hand encapsulates the system synchronization requirements, and on the other hand, provides a declarative specification of the system concurrency issues. This provide great advantages in writing concurrent programs and manipulating them while preserving correctness.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

An occam-π Implementation of a Distributed Robust Annealing Algorithm

Significant additions have recently been made to the occam concurrent programming language. The new occam-π now supports, among other features, mobile channels, mobile processes, shared channels, and dynamic forking of new concurrent processes at run-time. These features should greatly enhance the ability of occam to precisely and easily implement complex concurrent applications. We have recent...

متن کامل

An occam-pi Implementation of a Verified Distributed Robust Annealing Algorithm

Significant additions have recently been made to the occam concurrent programming language. The new occam-π now supports, among other features, mobile channels, mobile processes, shared channels, and dynamic forking of new concurrent processes. These features should greatly enhance the ability of occam to precisely and easily implement complex concurrent applications. We have recently evaluated...

متن کامل

SCOOP: Concurrent Programming Made Easy

The SCOOP model (Simple Concurrent Object-Oriented Programming) provides a simple yet very powerful mechanism for parallel computation. The model takes advantage of the inherent concurrency implicit in object-oriented programming to provide programmers with a simple extension enabling them to produce parallel applications with little more effort than sequential ones. SCOOP is applicable to many...

متن کامل

An Educational Game for Teaching and Learning Concurrency

Both teaching and learning concurrent programming are not easy tasks, in particular, for those beginners who have learnt and experienced sequential programming. However, there is no learning environment for beginners to learn concurrent programming enjoyably. In order to provide a learning environment by which beginners can learn and understand various concepts on concurrency naturally in playi...

متن کامل

Object-Oriented Programming and Protected Objects in Ada 95

Integrating concurrent and object-oriented programming has been an active research topic since the late 1980s. The majority of approaches have taken a sequential object-oriented language and made it concurrent. A few approaches have taken a concurrent language and made it object-oriented. The most important of this latter class is the Ada 95 language which is an extension to the object-based co...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2000